submitted to Shape Modeling Intersection Free Simplification

نویسنده

  • Stefan Gumhold
چکیده

Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. All of the existing approaches focus on the creation of a geometrically close approximation of the original model. In order to produce a simplified version of a model with close layers – such as dressed humans – self-intersections result in intolerable results. Even methods that allow the sewing of close surface parts lead to unpleasant self-intersections. Only the simplification envelops4 allow to completely prevent them. In this work we focus on the prevention and avoidance of self-intersection during simplication with vertex pair contractions. We examine the geomorph9 of the parametrized vertex pair contraction and detect collisions of the affected simplices. If no collision arises the operation cannot cause any new self-intersection. Otherwise we can simply discard the operation to prevent self-intersections as is done in the approach of simplification envelops. Our approach goes even further and tries to avoid the self-intersection by testing different target locations. This leads to better approximations as exhibited by a lower RMS and Hausdorff-distance. Furthermore our approach allows for arbitrary changes in the topology and garantees that geomorphs during progressive reception cannot cause self-intersections.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection Free Simplification

Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. All of the existing approaches focus on the creation of a geometrically close approximation of the original model. In order to produce a simp...

متن کامل

Marching Intersections: An Efficient Resampling Algorithm for Surface Management

The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called Marching Intersections (MI), adopts a volumetric approach and acts as a resampling filter: all the intersection points between the input model and the lines of a user selected 3D reference grid are located and then, beginning...

متن کامل

Morphological, Sedimentary and Hydrodynamic Study in Intersection of the Arvand River and the Karun River by Using Field Data and Numerical Modeling

Providing faultless proceeding of the engineer in order to protect the rivers, requires understanding the morphological behavior of the river and studying the hydrodynamic phenomena of the area. The intersection of the Karun rivers as the largest and longest river in Iran with the Arvand border river is of considerable importance due to its strategic location. In this paper, using field measure...

متن کامل

Space-Time Surface Simplification and Edgebreaker Compression for 2D Cel Animations

Digitized cel animations are typically composed of frames containing a small number of regions; each region contains pixels of the same color and exhibits a significant level of shape coherence through time. To exploit this coherence, we treat the stack of frames as a 3D volume and represent the evolution of each region by the bounding surface of the 3D sub-volume V that it sweeps out. To reduc...

متن کامل

Point-based Tetrahedral Mesh Simplification with Intersection-Free Surface Mesh Simplification

Simplification of tetrahedral meshes is an important tool to decrease the complexity of these datasets. Many visualization systems need the simplified version of a mesh to be fully interactive. This paper presents a rapid tetrahedral simplifier that works in three steps. First, the border of the tetrahedral mesh is simplified. Second, the interior of the mesh is point sampled such that the resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003